On the Distribution of Nodes in Distributed Hash Tables
نویسندگان
چکیده
We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distribution of interval sizes and an approximation of the distribution of data load among the participating peers. The results match previously published experimental studies on load distribution that motivated the research on load balancing. Most importantly, our model also gives a theoretical explanation for observed load behavior.
منابع مشابه
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalable and self-organizing approach for efficient and persistent distribution and retrieval of data. However the scalability and performance of DHTs is strongly based on an equal distribution of data across participating nodes. Beca...
متن کاملChord: Structured Overlay Network for Non-Uniform Load-Distribution
Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of O(logN) in networks of N nodes. While the routing performance has bee...
متن کاملRobust Object Replication in a DHT Ring
There have been a lot of studies on distributed storage systems and peer-to-peer file systems based on distributed hash tables (DHTs), in which nodes have global unique identifiers generated by a hash function. Since such distributed systems are built on top of a heterogeneous and unreliable infrastructure, replication techniques are often used to improve object availability. However, typical c...
متن کاملA Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems
Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-awa...
متن کاملA Load Balancing Algorithm Based on Replication and Movement of Data Items for Dynamic Structured P2p Systems
Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2...
متن کامل